Approximation algorithms for the multiprocessor open shop scheduling problem
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for the multiprocessor open shop scheduling problem
We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...
متن کاملApproximation Algorithms for Multiprocessor Scheduling Problem
In this paper, we consider the static multiprocessor scheduling problem for a class of multiprocessor systems consisting of m (≥ 1) identical processors connected by a complete network. The objective of this survey is to give a panoramic view of theoretical and/or practical approaches for solving the problem, that have been extensively conducted during the past three decades. key words: multipr...
متن کاملCat swarm optimization for solving the open shop scheduling problem
This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...
متن کاملApproximation Algorithms for the Open Shop Problem with Delivery Times
In this paper we consider the open shop scheduling problem where the jobs have delivery times. The minimization criterion is the maximum lateness of the jobs. This problem is known to be NP-hard, even restricted to only 2 machines. We establish that any list scheduling algorithm has a performance ratio of 2. For a fixed number of machines, we design a polynomial time approximation scheme (PTAS)...
متن کاملA tabu search approach for proportionate multiprocessor open shop scheduling
In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing centers -each having one or more parallel identical machines, while jobs do not have a pre-specified obligatory route. A special case is the proportionate multiprocessor open shop scheduling problem (PMOSP) in which the processing time on a given center is not job-dependent. Applications of the P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1999
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(99)00005-x